Deductive Verification of Hybrid Systems Using STeP
نویسندگان
چکیده
We investigate the feasibility of computer-aided deductive veriication of hybrid systems. Hybrid systems are modeled by phase transition systems, in which activities specify the bounds on the derivatives of the continuous variables. We present a method for invariant generation based on static analysis of the phase transition system. The in-variants produced can be used as auxiliary properties in the veriication of temporal properties. We show that in some cases the invariants thus produced suuce to prove the main safety property.
منابع مشابه
An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent ve...
متن کاملCombining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deductive and algebraic reasoning that is used for handling the joint discrete and continuous behaviour of hybrid systems. We illustrate proof tasks that occur when verifying scenarios with cooperative traffic agents. From...
متن کاملA Theorem Prover for Differential Dynamic Logic Deductive Verification of Hybrid Systems
This thesis aims at the computer aided verification of hybrid systems using deductive techniques. We have developed an interactive verification tool on the basis of a sound sequent calculus for dL. The logic dL is a dynamic logic with a special focus on the specification and verification of hybrid systems. Our implementation extends the theorem prover component of the KeY system with rules and ...
متن کاملApproaches to the Formal Verification of Hybrid Systems
Address: see R. Huuck, Tel. +49 431 5604-22, Email: [email protected] This paper presents two different approaches to the problem of formally verifying the correctness of control systems which consist of a logic controller and a continuous plant and, thus, constitute a hybrid system. One approach aims at algorithmic verification and combines Condition/Event Systems with Timed Automata. ...
متن کاملDeductive Schedulability Verification Methodology of Real-Time Software using both Refinement Verification and Hybrid Automata
Real-time software runs over real-time operating systems, and guaranteeing qualities is difficult. As timing constraints and resource allocations are strict, it is necessary to verify schedulability, safety and liveness properties. In this paper, we formally specify real-time software using hybrid automata and verify its schedulability using both deductive refinement theory and scheduling theor...
متن کامل